Global constraints in distributed constraint satisfaction
نویسندگان
چکیده
Global constraints have been crucial for the success of centralized constraint programming. Here, we propose the inclusion of global constraints in distributed constraint satisfaction. We show how this inclusion can be done, considering different decompositions for global contraints. We provide experimental evidence of their benefits on several benchmarks solved with the ABT algorithm.
منابع مشابه
Global Constraints in Distributed Constraint Satisfaction and Optimization
Global constraints are an essential component in the efficiency of centralized constraint programming. We propose to include global constraints in distributed constraint satisfaction and optimization problems (DisCSPs and DCOPs). We detail how this inclusion can be done, considering different representations for global constraints (direct, nested, binary). We explore the relation of global cons...
متن کاملDistributed Constraint Programming with Agents
Many combinatorial optimization problems lend themselves to be modeled as distributed constraint optimization problems (DisCOP). Problems such as job shop scheduling have an intuitive matching between agents and machines. In distributed constraint problems, agents control variables and are connected via constraints. We have equipped these agents with a full constraint solver. This makes it poss...
متن کاملTractable Combinations of Global Constraints
We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used; indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems. Previous work has focused on the development of ...
متن کاملAsynchronous Weak-Commitment Search for Solving Large-Scale Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) (Yokoo et aL 1992) is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Surprisingly a wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI which are concerned with finding a consistent combination of agent actions (e.g., dist...
متن کاملThe Distributed Constraint Satisfaction Problem: Formalization and Algorithms
In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various application problems in Distributed Artificial Intelligence can be formalized as distributed CSPs. We pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012